On Nested Justification Systems

نویسندگان

چکیده

Abstract Justification theory is a general framework for the definition of semantics rule-based languages that has high explanatory potential. Nested justification systems, first introduced by Denecker et al. , allow composition systems. This notion nesting thus enables modular languages, and increases representational capacities theory. As we show in this paper, original characterization nested systems leads to loss information relevant explanations. In view problem, provide an alternative their it equivalent one. Furthermore, how representing fixpoint definitions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Realization for justification logics via nested sequents: Modularity through embedding

Justification logics are refinements of modal logics, where justification terms replace modalities. Modal and justification logics are connected via the so-called realization theorems. We develop a general constructive method of proving the realization of a modal logic in an appropriate justification logic by means of cut-free modal nested sequent systems. We prove a constructive realization th...

متن کامل

designing unmanned aerial vehicle based on neuro-fuzzy systems

در این پایان نامه، کنترل نرو-فازی در پرنده هدایت پذیر از دور (پهپاد) استفاده شده است ابتدا در روش پیشنهادی اول، کنترل کننده نرو-فازی توسط مجموعه اطلاعات یک کنترل کننده pid به صورت off-line آموزش دیده است و در روش دوم یک کنترل کننده نرو-فازی on-line مبتنی بر شناسایی سیستم توسط شبکه عصبی rbf پیشنهاد شده است. سپس کاربرد این کنترل کننده در پهپاد بررسی شده است و مقایسه ای ما بین کنترل کننده های معمو...

Tableau Proof Systems for Justification Logics

In this paper we present tableau proof systems for various justification logics. We show that the tableau systems are sound and complete with respect to Mkrtychev models. In order to prove the completeness of the tableaux, we give a syntactic proof of cut elimination. We also show the subformula property for our tableaux.

متن کامل

Basic systems of epistemic logic with justification

An issue of an epistemic logic with justification has been discussed since the early 1990s. Such a logic, along with the usual knowledge operator 2F (F is known), should contain assertions t:F (t is a justification for F ), which gives a more nuanced and realistic model of knowledge. In this paper, we build two systems of epistemic logic with justification: the minimal one—S4LP—which is an exte...

متن کامل

On degrees of justification

This paper gives an explication of our intuitive notion of strength of justification in a controversial debate. It defines a thesis’ degree of justification within the bipolar argumentation framework of the theory of dialectical structures as the ratio of coherently adoptable positions according to which that thesis is true over all coherently adoptable positions. Broadening this definition, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory and Practice of Logic Programming

سال: 2022

ISSN: ['1471-0684', '1475-3081']

DOI: https://doi.org/10.1017/s1471068422000266